<title>[HDU3844]Mining Your Own Business</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;algorithm&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstring&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;iostream&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;vector&gt;</span><span class="pl-cp"></span>
<span class="pl-k">typedef</span> <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">ll</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">MAXN</span> <span class="pl-o">=</span> <span class="pl-mi">100100</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">MAXM</span> <span class="pl-o">=</span> <span class="pl-mi">100010</span><span class="pl-p">;</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">],</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">],</span> <span class="pl-n">Stack</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">dfs_clock</span><span class="pl-p">,</span> <span class="pl-n">top</span><span class="pl-p">,</span> <span class="pl-n">block</span><span class="pl-p">;</span>
<span class="pl-kt">bool</span> <span class="pl-n">iscut</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">];</span>
<span class="pl-n">vector</span><span class="pl-o">&lt;</span><span class="pl-kt">int</span><span class="pl-o">&gt;</span> <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">];</span>
<span class="pl-k">struct</span> <span class="pl-n">Edge</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">to</span><span class="pl-p">,</span> <span class="pl-n">next</span><span class="pl-p">;</span>
<span class="pl-p">}</span> <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">MAXM</span> <span class="pl-o">&lt;&lt;</span> <span class="pl-mi">1</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">MAXN</span><span class="pl-p">],</span> <span class="pl-n">tot</span><span class="pl-p">;</span>
<span class="pl-kt">void</span> <span class="pl-nf">addedge</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">v</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">tot</span><span class="pl-p">].</span><span class="pl-n">to</span> <span class="pl-o">=</span> <span class="pl-n">v</span><span class="pl-p">;</span>
    <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">tot</span><span class="pl-p">].</span><span class="pl-n">next</span> <span class="pl-o">=</span> <span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">];</span>
    <span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">tot</span><span class="pl-o">++</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">init</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-n">tot</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">head</span><span class="pl-p">,</span> <span class="pl-mh">0xff</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">head</span><span class="pl-p">));</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">Tarjan</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">pre</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">v</span><span class="pl-p">;</span>
    <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-o">++</span><span class="pl-n">dfs_clock</span><span class="pl-p">;</span>
    <span class="pl-n">Stack</span><span class="pl-p">[</span><span class="pl-n">top</span><span class="pl-o">++</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">u</span><span class="pl-p">;</span>
    <span class="pl-kt">int</span> <span class="pl-n">son</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-n">head</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">];</span> <span class="pl-n">i</span> <span class="pl-o">!=</span> <span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">next</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-n">v</span> <span class="pl-o">=</span> <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">to</span><span class="pl-p">;</span>
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">v</span> <span class="pl-o">==</span> <span class="pl-n">pre</span><span class="pl-p">)</span> <span class="pl-k">continue</span><span class="pl-p">;</span>
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">])</span> <span class="pl-p">{</span>
            <span class="pl-n">son</span><span class="pl-o">++</span><span class="pl-p">;</span>
            <span class="pl-n">Tarjan</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">,</span> <span class="pl-n">u</span><span class="pl-p">);</span>
            <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">min</span><span class="pl-p">(</span><span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span> <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]);</span>
            <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]</span> <span class="pl-o">&gt;=</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">])</span> <span class="pl-p">{</span>
                <span class="pl-n">iscut</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
                <span class="pl-n">block</span><span class="pl-o">++</span><span class="pl-p">;</span>
                <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">block</span><span class="pl-p">].</span><span class="pl-n">clear</span><span class="pl-p">();</span>
                <span class="pl-kt">int</span> <span class="pl-n">vn</span><span class="pl-p">;</span>
                <span class="pl-k">for</span> <span class="pl-p">(;;)</span> <span class="pl-p">{</span>
                    <span class="pl-n">vn</span> <span class="pl-o">=</span> <span class="pl-n">Stack</span><span class="pl-p">[</span><span class="pl-o">--</span><span class="pl-n">top</span><span class="pl-p">];</span>
                    <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">block</span><span class="pl-p">].</span><span class="pl-n">push_back</span><span class="pl-p">(</span><span class="pl-n">vn</span><span class="pl-p">);</span>
                    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">vn</span> <span class="pl-o">==</span> <span class="pl-n">v</span><span class="pl-p">)</span> <span class="pl-k">break</span><span class="pl-p">;</span>
                <span class="pl-p">}</span>
                <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">block</span><span class="pl-p">].</span><span class="pl-n">push_back</span><span class="pl-p">(</span><span class="pl-n">u</span><span class="pl-p">);</span>
            <span class="pl-p">}</span>
        <span class="pl-p">}</span> <span class="pl-k">else</span> <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">&gt;</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">])</span> <span class="pl-p">{</span>
            <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">];</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">pre</span> <span class="pl-o">&lt;</span> <span class="pl-mi">0</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">son</span> <span class="pl-o">==</span> <span class="pl-mi">1</span><span class="pl-p">)</span> <span class="pl-n">iscut</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-nb">false</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">solve</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">dfn</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">dfn</span><span class="pl-p">));</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">iscut</span><span class="pl-p">,</span> <span class="pl-nb">false</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">iscut</span><span class="pl-p">));</span>
    <span class="pl-n">dfs_clock</span> <span class="pl-o">=</span> <span class="pl-n">top</span> <span class="pl-o">=</span> <span class="pl-n">block</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span>
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])</span> <span class="pl-n">Tarjan</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">,</span> <span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">);</span>
    <span class="pl-n">ll</span> <span class="pl-n">ans1</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-n">ans2</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">block</span> <span class="pl-o">==</span> <span class="pl-mi">1</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-n">ans1</span> <span class="pl-o">=</span> <span class="pl-mi">2ll</span><span class="pl-p">;</span>
        <span class="pl-n">ans2</span> <span class="pl-o">=</span> <span class="pl-p">(</span><span class="pl-n">ll</span><span class="pl-p">)</span><span class="pl-n">n</span> <span class="pl-o">*</span> <span class="pl-p">(</span><span class="pl-n">n</span> <span class="pl-o">-</span> <span class="pl-mi">1</span><span class="pl-p">)</span> <span class="pl-o">/</span> <span class="pl-mi">2</span><span class="pl-p">;</span>
    <span class="pl-p">}</span> <span class="pl-k">else</span> <span class="pl-p">{</span>
        <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">block</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-kt">int</span> <span class="pl-n">z</span> <span class="pl-o">=</span> <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">size</span><span class="pl-p">();</span>
            <span class="pl-kt">int</span> <span class="pl-n">cut_cnt</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
            <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">j</span> <span class="pl-o">&lt;</span> <span class="pl-n">z</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">j</span><span class="pl-p">)</span> <span class="pl-p">{</span>
                <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">iscut</span><span class="pl-p">[</span><span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]])</span> <span class="pl-n">cut_cnt</span><span class="pl-o">++</span><span class="pl-p">;</span>
            <span class="pl-p">}</span>
            <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">cut_cnt</span> <span class="pl-o">==</span> <span class="pl-mi">1</span><span class="pl-p">)</span> <span class="pl-p">{</span>
                <span class="pl-n">ans1</span><span class="pl-o">++</span><span class="pl-p">;</span>
                <span class="pl-n">ans2</span> <span class="pl-o">*=</span> <span class="pl-p">(</span><span class="pl-n">ll</span><span class="pl-p">)(</span><span class="pl-n">z</span> <span class="pl-o">-</span> <span class="pl-mi">1</span><span class="pl-p">);</span>
            <span class="pl-p">}</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld %lld</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">ans1</span><span class="pl-p">,</span> <span class="pl-n">ans2</span><span class="pl-p">);</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">,</span> <span class="pl-n">cas</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-k">while</span> <span class="pl-p">(</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">)</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">m</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-kt">int</span> <span class="pl-n">n</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
        <span class="pl-n">init</span><span class="pl-p">();</span>
        <span class="pl-k">while</span> <span class="pl-p">(</span><span class="pl-n">m</span><span class="pl-o">--</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">v</span><span class="pl-p">);</span>
            <span class="pl-n">addedge</span><span class="pl-p">(</span><span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">);</span>
            <span class="pl-n">addedge</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">,</span> <span class="pl-n">u</span><span class="pl-p">);</span>
            <span class="pl-n">n</span> <span class="pl-o">=</span> <span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">));</span>
        <span class="pl-p">}</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;Case %d: &quot;</span><span class="pl-p">,</span> <span class="pl-n">cas</span><span class="pl-o">++</span><span class="pl-p">);</span>
        <span class="pl-n">solve</span><span class="pl-p">(</span><span class="pl-n">n</span><span class="pl-p">);</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>